Integrated Care Search: Adding Value to the Search Filter

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adding Search to Zinc

We describe a small, non-intrusive extension to the declarative modelling language Zinc that allows users to define model-specific search. This is achieved by providing a number of generic search patterns that take Zinc user-defined functions as parameters. We show the generality of the approach by using it to implement three very different kinds of search: backtracking search, branch-and-bound...

متن کامل

Improving Exploratory Search Interfaces: Adding Value or Information Overload?

One method for supporting more exploratory forms of search has been to include a compound of new interface features, such as facets, previews, collection points, synchronous communication, and note-taking spaces, within a single search interface. One side effect, however, is that some compounds can be confusing, rather than supportive during search. Faceted browsing, for example, conveys domain...

متن کامل

Adding Search to a Declarative Modelling Language

Modellers would like to automatically translate a declarative conceptual model of a constrained combinatorial problem into an efficient design model. However, for efficiency, most solving techniques require a model-specific search strategy, which is inherently procedural and, thus, difficult to integrate with the declarative conceptual model. This paper describes a small, non-intrusive extensio...

متن کامل

Adding Structure to Web Search with iTrails

We would like to discuss with workshop participants the iTrails framework for pay-as-you-go information integration, which was recently presented at VLDB 2007 [1]. iTrails allows users to provide mini-mappings on their data that sharply increase the quality of search results. The core idea is to extend the semantics of a standard graphical search engine such that the quality of search results a...

متن کامل

Adding Exploration to Greedy Best-First Search

While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause the algorithm to get stuck performing a lot of unnecessary work. In this report, we consider simple ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Integrated Care

سال: 2018

ISSN: 1568-4156

DOI: 10.5334/ijic.s2382